Color quantization of images

نویسندگان

  • Michael T. Orchard
  • Charles A. Bouman
چکیده

1 Many image display devices allow only a limited number of colors to be simultaneously displayed. Usually, this set of available colors, called a color palette, may be selected by a user from a wide variety of available colors. Such device restrictions make it particularly difficult to display natural color images since these images usually contain a wide range of colors which must then be quantized by a palette with limited size. This color quantization problem is considered in two parts: the selection of an optimal color palette and the optimal mapping of each pixel of the image to a color from the palette. This paper develops algorithms for the design of hierarchical tree structured color palettes incorporating performance criteria which reflect subjective evaluations of image quality. Tree structured color palettes greatly reduce the computational requirements of the palette design and pixel mapping tasks, while allowing colors to be properly allocated to densely populated areas of the color space. The algorithms produce higher quality displayed images and require less computations than previously proposed methods. Error diffusion techniques are commonly used for displaying images which have been quantized to very few levels. This paper studies problems related to the application of error diffusion techniques to the display of color images. A modified error diffusion technique is proposed for resolving these problems. The new error diffusion techinque is shown to be easily implemented using the tree structured color palettes developed earlier. EDICS #6.2.6 Image Transformations for Display and Printing †This work was supported by the Office of Naval Research and the Naval Research Laboratory under Grant N00014-87-0189, by an IBM Graduate Fellowship, and by an AT&T Fellowship. ‡IEEE Trans. on Sig. Proc., vol. 39, no. 12, pp. 2677-2690, Dec. 1991. Permission to publish this abstract separately is granted.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

کاهش رنگ تصاویر با شبکه‌های عصبی خودسامانده چندمرحله‌ای و ویژگی‌های افزونه

Reducing the number of colors in an image while preserving its quality, is of importance in many applications such as image analysis and compression. It also decreases memory and transmission bandwidth requirements. Moreover, classification of image colors is applicable in image segmentation and object detection and separation, as well as producing pseudo-color images. In this paper, the Kohene...

متن کامل

Color quantization and processing by Fibonacci lattices

Color quantization is sampling of three-dimensional (3-D) color spaces (such as RGB or Lab) which results in a discrete subset of colors known as a color codebook or palette. It is extensively used for display, transfer, and storage of natural images in Internet-based applications, computer graphics, and animation. We propose a sampling scheme which provides a uniform quantization of the Lab sp...

متن کامل

Color Image Quantization for Frame Buffer Display Color Image Quantization for Frame Buffer Display

Algorithms for approximately optimal quantization of color images are discussed. The distortion measure used is the distance in RGB space. These algorithms are used to compute the color map for low-depth frame buffers in order to allow high-quality static images to be displayed. It is demonstrated that most color images can be very well displayed using only 256 or 512 colors. Thus frame buffers...

متن کامل

Disguised Face Recognition by Using Local Phase Quantization and Singular Value Decomposition

Disguised face recognition is a major challenge in the field of face recognition which has been taken less attention. Therefore, in this paper a disguised face recognition algorithm based on Local Phase Quantization (LPQ) method and Singular Value Decomposition (SVD) is presented which deals with two main challenges. The first challenge is when an individual intentionally alters the appearance ...

متن کامل

On Color Image Quantization by the K-Means Algorithm

In this paper we show the main properties of k-means algorithm as a tool for color image quantization. All experiments have been carried out on color images with different number of unique colors and different colorfulness. We have tested the influence of methods of determination of initial cluster centers, of choice of distance metric, of choice of color space. In our tests we have used two di...

متن کامل

Sequential scalar quantization of color images

An efficient algorithm for color image quantization is proposed based on a new vector quantization technique that we call sequential scalar quantization. The scalar components of the 3-D color vector are individually quantized in a predetermined sequence. With this technique, the color palette is designed very efficiently, while pixel mapping is performed with no computation. To obtain an optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 39  شماره 

صفحات  -

تاریخ انتشار 1991